#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=110;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],b[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL n;cin>>n;
    memset(a,0,sizeof(a));memset(b,0,sizeof(b));
    cin>>a[1]>>a[2]>>a[3]>>a[4];
    bool flag=1;
    for(LL i=1;i<=4;i++){
        if(a[i]==n) flag=0;
    }
    if(1==flag){
        cout<<"YES"<<"\n";
    }
    else{
        if(a[1]==n) b[2]++,b[4]++;
        if(a[2]==n) b[1]++,b[3]++;
        if(a[3]==n) b[2]++,b[4]++;
        if(a[4]==n) b[1]++,b[3]++;
        if(a[1]<b[1]||a[2]<b[2]||a[3]<b[3]||a[4]<b[4]){
            cout<<"NO"<<"\n";
        }
        else cout<<"YES"<<"\n";
    }
  }
return 0;
}
